Isogonal Kaleidoscopical Polyhedra Families
نویسنده
چکیده
A new class of isogonal polyhedra is considered. Polyhedra are constructed using a combination of reflections in several symmetry planes of a given symmetry group. The procedure is a generalization of a Wythoff construction used for building uniform polyhedra. Every valid combination of symmetry planes generates an entire family of isogonal polyhedra. There are seven families with tetrahedral symmetry, 284 with octahedral symmetry, and a few million with icosahedral symmetry.
منابع مشابه
The {4, 5} Isogonal Sponges on the Cubic Lattice
Isogonal polyhedra are those polyhedra having the property of being vertextransitive. By this we mean that every vertex can be mapped to any other vertex via a symmetry of the whole polyhedron; in a sense, every vertex looks exactly like any other. The Platonic solids are examples, but these are bounded polyhedra and our focus here is on infinite polyhedra. When the polygons of an infinite isog...
متن کاملParallelogram-faced isohedra with edges in mirror-planes
Regular (or Platonic) polyhedra have been studied since antiquity, and many other kinds of polyhedra with various symmetry properties have been investigated since then. These include the traditional Archimedean polyhedra (regular-faced with congruent vertex gures), isohedra (polyhedra with faces all equivalent under symmetries of the polyhedron), isogonal polyhedra (all vertices of which are eq...
متن کاملVertex-Transitive Polyhedra in 3-Space
In addition to regular and chiral polyhedra, which have been extensively studied, the vertextransitive polyhedra of higher genus also present an attractive and worthwhile challenge. While the definition is combinatorial, the problem at hand is the realization in Euclidean 3-space as a highly symmetric, non-self-intersecting polyhedron in the more classical sense (with flat, non-self-intersectin...
متن کاملKaleidoscopical Configurations in G-Spaces
Let G be a group and X be a G-space with the action G×X → X, (g, x) 7→ gx. A subset F of X is called a kaleidoscopical configuration if there exists a coloring χ : X → C such that the restriction of χ on each subset gF , g ∈ G, is a bijection. We present a construction (called the splitting construction) of kaleidoscopical configurations in an arbitrary G-space, reduce the problem of characteri...
متن کاملCharacterization and Construction of a Family of Highly Symmetric Spherical Polyhedra with Application in Modeling Self-Assembling Structures
The regular polyhedra have the highest order of 3D symmetries and are exceptionally attractive templates for (self)-assembly using minimal types of building blocks, from nano-cages and virus capsids to large scale constructions like glass domes. However, they only represent a small number of possible spherical layouts which can serve as templates for symmetric assembly. In this paper, we formal...
متن کامل